A note on the representation and definition of semiseparable matrices
نویسندگان
چکیده
In this paper the definition of semiseparable matrices is investigated. Properties of the frequently used definition and the corresponding representation by generators are deduced. Corresponding to the class of tridiagonal matrices another definition of semisepar-able matrices is introduced preserving the nice properties dual to the class of tridiagonal matrices. Several theorems and properties are included showing the viability of this alternative definition. Because of the alternative definition, the standard representation of semiseparable matrices is not satisfying anymore. The concept of a representation is explicitely formulated and a new kind of representation corresponding to the alternative definition is given. It is proved that this representation keeps all the interesting properties of the generator representation. As an example of the effectivity of the new representation, we design on O(n) algorithm for the multiplication of a semiseparable matrix given by the new representation, with a vector. A note on the representation and definition of semiseparable matrices * Abstract In this paper the definition of semiseparable matrices is investigated. Properties of the frequently used definition and the corresponding representation by generators are deduced. Corresponding to the class of tridiagonal matrices another definition of semiseparable matrices is introduced preserving the nice properties dual to the class of tridiagonal matrices. Several theorems and properties are included showing the viability of this alternative definition. Because of the alternative definition, the standard representation of semisepar-able matrices is not satisfying anymore. The concept of a representation is expli-citely formulated and a new kind of representation corresponding to the alternative definition is given. It is proved that this representation keeps all the interesting properties of the generator representation. As an example of the effectivity of the new representation, we design on O(n) algorithm for the multiplication of a semiseparable matrix given by the new representation , with a vector.
منابع مشابه
A bibliography on semiseparable matrices
Currently there is a growing interest in semiseparable matrices and generalized semiseparable matrices. As it is interesting to know the historical evolution of this concept, we present in this paper an extensive list of publications related to the field of semiseparable matrices. It is interesting to see that semiseparable matrices were investigated in different fields, e.g. integral equations...
متن کاملO(n) Algorithms for Banded Plus Semiseparable Matrices
We present a new representation for the inverse of a matrix that is a sum of a banded matrix and a semiseparable matrix. In particular, we show that under certain conditions, the inverse of a banded plus semiseparable matrix can also be expressed as a banded plus semiseparable matrix. Using this result, we devise a fast algorithm for the solution of linear systems of equations involving such ma...
متن کاملA new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
This paper proposes a new type of iteration based on a structured rank factorization for computing eigenvalues of semiseparable and semiseparable plus diagonal matrices. Also the case of higher order semiseparability ranks is included. More precisely, instead of the traditional QR-iteration, a QH-iteration will be used. The QH-factorization is characterized by a unitary matrix Q and a Hessenber...
متن کاملTransforming a hierarchical into a unitary-weight representation
In this paper we consider a class of hierarchically rank structured matrices, including some of the hierarchical matrices occurring in the literature, such as hierarchically semiseparable (HSS) and certain H∈-matrices. We describe a fast O(rn log(n)) and stable algorithm to transform this hierarchical representation into a so-called unitary-weight representation, as introduced in an earlier wor...
متن کاملCOMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS
The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 12 شماره
صفحات -
تاریخ انتشار 2005